The enumeration degrees: Local and global structural interactions

نویسندگان

  • THEODORE A. SLAMAN
  • MARIYA I. SOSKOVA
چکیده

We show that the structure of the enumeration degrees De has a finite automorphism base consisting of finitely many total elements below the first jump of its least element. As a consequence we obtain that the rigidity of the structure of the enumeration degrees is implied by the rigidity of the local structures of the Σ2 enumeration degrees, the ∆ 0 2 Turing degrees and the computably enumerable Turing degrees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cupping and definability in the local structure of the enumeration degrees

We show that every splitting of 0e in the local structure of the enumeration degrees, Ge, contains at least one low-cuppable member. We apply this new structural property to show that the classes of all K-pairs in Ge, all downwards properly Σ2 enumeration degrees and all upwards properly Σ2 enumeration degrees are first order definable in Ge.

متن کامل

Interpreting true arithmetic in the local structure of the enumeration degrees

Degree theory studies mathematical structures, which arise from a formal notion of reducibility between sets of natural numbers based on their computational strength. In the past years many reducibilities, together with their induced degree structures have been investigated. One of the aspects in these investigations is always the characterization of the theory of the studied structure. One dis...

متن کامل

Kalimullin Pairs of Σ2 Ω-enumeration Degrees

We study the notion of K-pairs in the local structure of the ωenumeration degrees. We introduce the notion of super almost zero sequences and investigate their structural properties. The study of degree structures has been one of the central themes in computability theory. Although the main focus has been on the structure of the Turing degrees and its local substructure, of the degrees below th...

متن کامل

On Kalimullin pairs

We study Kalimullin pairs, a definable class (of pairs) of enumeration degrees that has been used to give first-order definitions of other important classes and relations, including the enumeration jump and the total enumeration degrees. We show that the global definition of Kalimullin pairs is also valid in the local structure of the enumeration degrees, giving a simpler local definition than ...

متن کامل

Embedding distributive lattices in the Σ02 enumeration degrees

The local structure of the enumeration degrees Ge is the partially ordered set of the enumeration degrees below the first jump 0e of the least enumeration degree 0e. Cooper [3] shows that Ge consists exactly of the Σ2 enumeration degrees, degrees which contain Σ2 sets, or equivalently consist entirely of Σ 0 2 sets. In investigating structural complexity of Ge, the natural question of what othe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015